« A fairly typical boy », « a fairly typical girl »

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A (fairly) Simple Circuit that (usually) Sorts

This paper provides an analysis of a natural k-round tournament over n = 2' players, and demonstrates that the tournament possesses a surprisingly strong ranking property. The ranking property of this tournament is exploited by using it as a building block for efficient parallel sorting algorithms under a variety of different models of computation. Three important applications are provided. Fir...

متن کامل

How to Re-Divide a Cake Fairly

We study the classic problem of fairly dividing a heterogeneous resource (”cake”) among several agents with different preferences. In our setting, the resource is already divided among several ”old” agents. When ”young” agents come, the resource should be re-divided in a way that is fair both for the young and for the old agents. Motivated by land redivision and other two-dimensional division p...

متن کامل

How to divide a polygon fairly

Let P be a simple polygon with N vertices, each assigned a weight c (0<i<N) with c€{0 , l } . We define the weight C of P as the added weight of its vertices, i.e., C = c 1 +. . . + c A r Making the assumption that the vertices of P have been sorted along some axis -which can be done in 0(Mog AO time-, we prove that it is possible, in O(N) time, to find two vertices a,b in P, such that the segm...

متن کامل

How to Divide Things Fairly

We analyze a simple sequential algorithm (SA) for allocating indivisible items that are strictly ranked by n ≥ 2 players. It yields at least one Pareto-optimal allocation which, when n = 2, is envy-free unless no envy-free allocation exists. However, an SA allocation may not be maximin or Borda maximin—maximize the minimum rank, or the Borda score, of the items received by a player. Although SA...

متن کامل

Dividing Connected Chores Fairly

In this paper we consider the fair division of chores (tasks that need to be performed by agents, with negative utility for them), and study the loss in social welfare due to fairness. Previous work has been done on this so-called price of fairness, concerning fair division of cakes and chores with non-connected pieces and of cakes with connected pieces. We provide tight or nearly tight bounds ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Emulations - Revue de sciences sociales

سال: 2018

ISSN: 1784-5734,2030-5656

DOI: 10.14428/emulations.015.004